Steklov regularization and trajectory methods for univariate global optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trajectory Optimization Using Global Methods

This paper compares three different global indirect approaches for solving the problem of finding optimal trajectories for low thrust spacecraft. The three methods tested were downhill simplex, genetic algorithms and simulated annealing. Two problems are analyzed. The first is a planar low thrust problem. This is the problem of finding a minimum time trajectory from Earth to Mars orbit using a ...

متن کامل

Trajectory Methods in Global Optimization

We review the application of trajectory methods (not including homotopy methods) to global optimization problems. The main ideas and the most successful methods are described and directions of current and future research are indicated.

متن کامل

Direct and indirect methods for trajectory optimization

This paper gives a brief list of commonly used direct and indirect efficient methods for the numerical solution of optimal control problems. To improve the low accuracy of the direct methods and to increase the convergence areas of the indirect methods we suggest a hybrid approach. For this a special direct collocation method is presented. In a hybrid approach this direct method can be used in ...

متن کامل

Test Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints

Abstract. In this paper, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal are considered. Two sets of test problems are introduced, in the first one both the objective function and constraints are differentiable functions and in the second one they are non-differentiable. Each series of tests contains 3 problems...

متن کامل

Homotopy Optimization Methods for Global Optimization

We define a new method for global optimization, the Homotopy Optimization Method (HOM). This method differs from previous homotopy and continuation methods in that its aim is to find a minimizer for each of a set of values of the homotopy parameter, rather than to follow a path of minimizers. We define a second method, called HOPE, by allowing HOM to follow an ensemble of points obtained by per...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 2019

ISSN: 0925-5001,1573-2916

DOI: 10.1007/s10898-019-00837-3